Fully bilinear generic and lifted random processes comparisons
نویسنده
چکیده
In our companion paper [14] we introduce a collection of fairly powerful statistical comparison results. They relate to a general comparison concept and its an upgrade that we call lifting procedure. Here we provide a different generic principle (which we call fully bilinear) that in certain cases turns out to be stronger than the corresponding one from [14]. Moreover, we also show how the principle that we introduce here can also be pushed through the lifting machinery of [14]. Finally, as was the case in [14], here we also show how the well known Slepian’s max and Gordon’s minmax comparison principles can be obtained as special cases of the mechanisms that we present here. We also create their lifted upgrades which happen to be stronger than the corresponding ones in [14]. A fairly large collection of results obtained through numerical experiments is also provided. It is observed that these results are in an excellent agreement with what the theory predicts.
منابع مشابه
Lifted Message Passing as Reparametrization of Graphical Models
Lifted inference approaches can considerably speed up probabilistic inference in Markov random fields (MRFs) with symmetries. Given evidence, they essentially form a lifted, i.e., reduced factor graph by grouping together indistinguishable variables and factors. Typically, however, lifted factor graphs are not amenable to offthe-shelf message passing (MP) approaches, and hence requires one to u...
متن کاملControl of the bilinear Schrödinger equation for fully coupling potentials
We present a general result of approximate controllability for the bilinear Schrödinger equation (with wave function varying in the unit sphere of an infinite dimensional Hilbert space), under the hypothesis that the Schrödinger operator has discrete spectrum and that the control potential couples all eigenstates. The control method is based on a tracking procedure for the Galerkin approximatio...
متن کاملEfficient Leakage-Resilient Signature Schemes in the Generic Bilinear Group Model
We extend the techniques of Kiltz et al. (in ASIACRYPT 2010) and Galindo et al. (in SAC 2012) to construct two efficient leakage-resilient signature schemes. Our schemes based on Boneh-LynnShacham (BLS) short signature and Waters signature schemes, respectively. Both of them are more efficient than Galindo et al.’s scheme, and can tolerate leakage of (1− o(1))/2 of the secret key at every signa...
متن کاملLifted Inequalities for 0 − 1 Mixed - Integer Bilinear Covering Sets ∗
4 In this paper, we study 0−1 mixed-integer bilinear covering sets. We derive several families of facet5 defining inequalities via sequence-independent lifting techniques. We then show that these sets have 6 polyhedral structures that are similar to those of certain fixed-charge single-node flow sets. As a result, we 7 obtain new facet-defining inequalities for these sets that generalize well-k...
متن کاملSub-linear Size Pairing-based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability and arithmetic circuits with perfect completeness, perfect zero-knowledge and computational (co-)soundness. The non-interactive zeroknowledge arguments have sub-linear size and very efficient public verification. Our construction uses bilinear groups and is only proven secure in the generic group model, but does no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1612.08516 شماره
صفحات -
تاریخ انتشار 2016